侯新民
Click:
The Founding Time:..
The Last Update Time:..
· Scan attention
·Paper Publications
- [1] [21] Hou Xinmin, Qiu Yu, Liu Boyuan, Extremal graph for intersecting odd cycles, Electron. J. Combin., 23(2016): P2.29.
- [2] [20] Hou Xinmin, Qiu, Yu, Liu Boyuan, Turan number and decomposition number of intersecting odd cycles, Discrete Math., 341(2018):126-137..
- [3] [19] Hou Xinmin, Yu Lei, Gao Jun, Liu Boyuan, The size of 3-uniform hypergraphs with given matching number and codegree, Discrete Math., 342 (2019): 760-767..
- [4] [18] Gao Jun, Hou Xinmin, The spectral radius of graphs without long cycles, Linear Algebra Appl., 566(2019): 17-33..
- [5] [17] Lei Yu, Xinmin Hou, Yue Ma, Boyuan Liu, Exact minimum codegree thresholds for K_4-covering and K_5-covering, Electron. J. Combin., 27(2020), P3.22..
- [6] [16] Boyuan Liu, Xinmin Hou, Yue Ma, Codegree threshold for tiling balanced complete 3-partite 3-graphs and generalized 4-cycles, Electron. J. Combin., 27(2020), P3.47..
- [7] [15] Yue Ma, Xinmin Hou, Jun Gao, Minimum degree of 3-graphs without long linear paths, Discrete Math., 343(2020), 111949..
- [8] [14] Yue Ma, Xinmin Hou, Doudou Hei, Jun Gao, Minimizing the number of edges in C_{\geq r}- saturated graphs, Discrete Math., 344 (2021), 112565..
- [9] [13] Xinmin Hou, Boyuan Liu, Shicheng Wang, Jun Gao, and Chenhui Lv, The spectral radius of graphs without trees of diameter at most four, Linear & Multilinear Algebra, 69(8)(2021), 1407-1414..
- [10] [12] Anyao Wang, Xinmin Hou, Boyuan Liu, Yue Ma, The Turan number for the edge blow-up of trees, Discrete Math., 344(2021), 112627..